
public class Prime {
	public  boolean isPrime(int n) {
			int i;
			for(i=2;i<n/2;i++){
				if(n%i==0)
					break;
			}
			if(i>=n/2)return true;
			return false;
	}

	public void judge(int n) {
		if (n < 6 || n % 2 == 1) {
			return;
		}
		for (int i = 2; i <= n - 1; i++) {
			if (this.isPrime(i) && this.isPrime(n - i)) {
				System.out.println(n + "=" + i + "+" + (n - i));
			}
		}
	}
}

